Spaces of Matrices with Several Zero Eigenvalues
نویسنده
چکیده
Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn (V, V)) with the property that every mapping has at least r zero eigenvalues. If r = 0 this condition is vacuous but if r = 1 it states that SC is a space of singular mappings; in this case Flanders [1] has shown that d im#"^n(n — 1) and that if dim #" = n(n — 1) then either SC = Hom(K, U) for some (n — l)-dimensional subspace U of V or there exists veV,v ^0 such that SC {X e Horn {V, V): vX = 0}. At the other extreme r = n, the case of nilpotent mappings, a theorem of Gerstenhaber [2] states that dim SC ^ |n(n 1 ) and that if dim SC = $n(n -1) then SC is the full algebra of strictly lower triangular matrices (with respect to some suitable basis of V). In this paper we intend to derive similar results for a general value of r thereby providing some common ground for the above theorems. The condition on the cardinal of F plays an important role in our proofs although we do not know whether it is essential to the theorems. Flanders required also the constraint char F ^ 2 at one point in his proof; we do not require this and in fact our type of argument allows the field in Flanders' theorem to have arbitrary characteristic.
منابع مشابه
A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملProperties of matrices with numerical ranges in a sector
Let $(A)$ be a complex $(ntimes n)$ matrix and assume that the numerical range of $(A)$ lies in the set of a sector of half angle $(alpha)$ denoted by $(S_{alpha})$. We prove the numerical ranges of the conjugate, inverse and Schur complement of any order of $(A)$ are in the same $(S_{alpha})$.The eigenvalues of some kinds of matrix product and numerical ranges of hadmard product, star-congruen...
متن کاملRenormalizing Rectangles and Other Topics in Random Matrix Theory
Abstract We consider random Hermitian matrices made of complex or real M × N rectangular blocks, where the blocks are drawn from various ensembles. These matrices have N pairs of opposite real nonvanishing eigenvalues, as well as M − N zero eigenvalues (for M > N .) These zero eigenvalues are “kinematical” in the sense that they are independent of randomness. We study the eigenvalue distributio...
متن کاملAsymptotic distribution of eigenvalues of the elliptic operator system
Since the theory of spectral properties of non-self-accession differential operators on Sobolev spaces is an important field in mathematics, therefore, different techniques are used to study them. In this paper, two types of non-self-accession differential operators on Sobolev spaces are considered and their spectral properties are investigated with two different and new techniques.
متن کامل